calculable functions造句

• On the other hand, the Church Turing thesis states that the above three formally-defined classes of computable functions coincide with the " informal " notion of an effectively calculable function.
• In fact, for some effectively calculable functions it can be shown that any algorithm that computes them will be very inefficient in the sense that the running time of the algorithm increases computational complexity study functions that can be computed efficiently.
• At about the same time, in an effort to solve Hilbert's Entscheidungsproblem, mathematicians set about to define what was meant by an " effectively calculable function " ( Alonzo Church 1936 ), i . e ., " effective method " or " algorithm ", that is, an explicit, step-by-step procedure that would succeed in computing a function.